Multiobjective Interaction Programming Problem with Interaction Constraint for Two Players
نویسندگان
چکیده
This paper extends an existing cooperative multi-objective interaction programming problem with interaction constraint for two players or two agents . First, we define an s-optimal joint solution with weight vector to multi-objective interaction programming problem with interaction constraint for two players and get some properties of it. It is proved that the s-optimal joint solution with weight vector to the multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Then, we define another soptimal joint solution with weight value to multi-objective interaction programming problem with interaction constraint for two players and get some of its properties. It is proved that the soptimal joint solution with weight vector to multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Finally, we build a pricing multi-objective interaction programming model for a bi-level supply chain. Numerical results show that the interaction programming pricing model is better than Stackelberg pricing model and the joint pricing model.
منابع مشابه
A General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملA satisfactory strategy of multiobjective two person matrix games with fuzzy payoffs
The multiobjective two person matrix game problem with fuzzy payoffs is considered in this paper. It is assumed that fuzzy payoffs are triangular fuzzy numbers. The problem is converted to several multiobjective matrix game problems with interval payoffs by using the $alpha$-cuts of fuzzy payoffs. By solving these problems some $alpha$-Pareto optimal strategies with some interval outcomes are o...
متن کاملLinear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014